Undecidability in Integer Weighted Finite Automata
نویسندگان
چکیده
It is shown that the universe problem L(A ) = A is undecidable for 4-state nite automata A with integer weights such that the weights of the paths are unimodal. The language L(A ) is de ned as the set of words w for which there exists a path of A having zero weight, that is, ( ) = 0.
منابع مشابه
Finite Substitutions and Integer Weighted Finite Automata
In this work we present a new chain of undecidability reductions, which begins from the classical halting problem of Turing machines and ends to the undecidability proof of the equivalence problem for nite substitutions on regular languages in Chapter 4. This undecidability result was originally proved by L. Lisovik in 1997. We present a new proof, which is shorter and more elementary than the ...
متن کاملUndecidability in Matrices over Laurent Polynomials
We show that it is undecidable for finite sets S of upper triangular 4 × 4matrices over Z[x, x−1] whether or not all elements in the semigroup generated by S have a nonzero constant term in some of the Laurent polynomials of the first row. This result follows from a representations of the integer weighted finite automata by matrices over Laurent polynomials.
متن کاملOn model-checking timed automata with stopwatch observers
In this paper we study the model-checking problem for weighted timed automata and the weighted CTL logic ; we also study the finiteness of bisimulations of weighted timed automata. Weighted timed automata are timed automata extended with costs on both edges and locations. When the costs act as stopwatches, we get stopwatch automata with the restriction that the stopwatches cannot be reset nor t...
متن کاملBisimulation Metrics for Weighted Automata
We develop a new bisimulation (pseudo)metric for weighted finite automata (WFA) that generalizes Boreale’s linear bisimulation relation. Our metrics are induced by seminorms on the state space of WFA. Our development is based on spectral properties of sets of linear operators. In particular, the joint spectral radius of the transition matrices of WFA plays a central role. We also study continui...
متن کاملModel-Checking for Weighted Timed Automata
We study the model-checking problem for weighted timed automata and the weighted CTL logic by the bisimulation approach. Weighted timed automata are timed automata extended with costs on both edges and locations. When the costs act as stopwatches, we get stopwatch automata with the restriction that the stopwatches cannot be reset and tested. The weighted CTL logic is an extension of TCTL that a...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
- Fundam. Inform.
دوره 38 شماره
صفحات -
تاریخ انتشار 1999